Close

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier8JMKD3MGPBW4/35S66QS
Repositorysid.inpe.br/sibgrapi@80/2009/08.17.20.01
Last Update2009:08.17.20.01.22 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi@80/2009/08.17.20.01.24
Metadata Last Update2022:06.14.00.14.02 (UTC) administrator
DOI10.1109/SIBGRAPI.2009.19
Citation KeySchmitzDietComb:2009:EfHiQu
TitleEfficient and High Quality Contouring of Isosurfaces on Uniform Grids
FormatPrinted, On-line.
Year2009
Access Date2024, May 03
Number of Files1
Size8218 KiB
2. Context
Author1 Schmitz, Leonardo Augusto
2 Dietrich, Carlos Augusto
3 Comba, João Luiz Dihl
Affiliation1 Instituto de Informática, Universidade Federal do Rio Grande do Sul
2 Instituto de Informática, Universidade Federal do Rio Grande do Sul
3 Instituto de Informática, Universidade Federal do Rio Grande do Sul
EditorNonato, Luis Gustavo
Scharcanski, Jacob
e-Mail Addresslaschmitz@inf.ufrgs.br
Conference NameBrazilian Symposium on Computer Graphics and Image Processing, 22 (SIBGRAPI)
Conference LocationRio de Janeiro, RJ, Brazil
Date11-14 Oct. 2009
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2010-08-28 20:03:26 :: laschmitz@inf.ufrgs.br -> administrator ::
2022-06-14 00:14:02 :: administrator -> :: 2009
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
KeywordsIsosurface extraction
Volumetric visualization
Contouring
AbstractThe interactive polygonization of isosurfaces has become possible with the mapping of the Marching Cubes (MC) and Marching Tetrahedra (MT) algorithms to GPUs. Such mapping is not as straightforward in cases that the algorithm generate meshes closer to the isosurface or result in better polygon shapes, since they often require complex computations for the vertex positioning of the polygons or even do not have table-driven implementations. In this paper, we revisit Dual Contouring (DC) and Macet algorithms and propose, respectively: (i) a novel parallel efficient version on uniform grids and (ii) novel GPU modules which extend the original MC. Our DC algorithm is table-driven and positions the vertices in a particle-based fashion, which is then used to map into a GPU implementation. In addition, we enumerate the current ways to implement efficient contouring algorithms on the GPUs as orthogonal features, and present the tradeoff of each approach. We validate the efficiency of our algorithms with its comparison to interactive versions of MC algorithms.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2009 > Efficient and High...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Efficient and High...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGPBW4/35S66QS
zipped data URLhttp://urlib.net/zip/8JMKD3MGPBW4/35S66QS
Languageen
Target FilelowResInteractive.pdf
User Grouplaschmitz@inf.ufrgs.br
Visibilityshown
5. Allied materials
Next Higher Units8JMKD3MGPEW34M/46SJQ2S
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/05.14.19.43 3
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark mirrorrepository nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close